Two Fast Marching Methods for HamiltonâJacobi Equations
نویسندگان
چکیده
منابع مشابه
Fast Two-scale Methods for Eikonal Equations
Fast Marching and Fast Sweeping are the two most commonly used methods for solving the Eikonal equation. Each of these methods performs best on a different set of problems. Fast Sweeping, for example, will outperform Fast Marching on problems where the characteristics are largely straight lines. Fast Marching, on the other hand, is usually more efficient than Fast Sweeping on problems where cha...
متن کاملFast Marching Methods - Parallel Implementation and Analysis
Fast Marching represents a very efficient technique for solving front propagation problems, which can be formulated as partial differential equations with Dirichlet boundary conditions, called Eikonal equation:
متن کاملFast Marching Methods for Stationary Hamilton-Jacobi Equations with Axis-Aligned Anisotropy
The fast marching method (FMM) has proved to be a very efficient algorithm for solving the isotropic Eikonal equation. Because it is a minor modification of Dijkstra’s algorithm for finding the shortest path through a discrete graph, FMM is also easy to implement. In this paper we describe a new class of Hamilton–Jacobi (HJ) PDEs with axis-aligned anisotropy which satisfy a causality condition ...
متن کاملFast marching methods for the continuous traveling salesman problem.
We consider a problem in which we are given a domain, a cost function which depends on position at each point in the domain, and a subset of points ("cities") in the domain. The goal is to determine the cheapest closed path that visits each city in the domain once. This can be thought of as a version of the traveling salesman problem, in which an underlying known metric determines the cost of m...
متن کاملTwo Semi-Lagrangian Fast Methods for Hamilton-Jacobi-Bellman Equations
In this paper we apply the Fast Iterative Method (FIM) for solving general Hamilton–Jacobi–Bellman (HJB) equations and we compare the results with an accelerated version of the Fast Sweeping Method (FSM). We find that FIM can be indeed used to solve HJB equations with no relevant modifications with respect to the original algorithm proposed for the eikonal equation, and that it overcomes FSM in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: PAMM
سال: 2007
ISSN: 1617-7061,1617-7061
DOI: 10.1002/pamm.200700002